Duality and evolving set bounds on mixing times
نویسنده
چکیده
We sharpen the Evolving set methodology of Morris and Peres and extend it to study convergence in total variation, relative entropy, L2 and other distances. Bounds in terms of a modified form of conductance are given which apply even for walks with no holding probability. These bounds are found to be strictly better than earlier Evolving set bounds, may be substantially better than conductance profile results derived via Spectral profile, drastically sharpen Blocking Conductance bounds if there are no bottlenecks at small sets, and give intuition into the workings of Canonical Path methods. This paper is intended solely to develop theoretical underpinnings, and as such we focus on two points : proving the sharpest most general results we can, and showing the Evolving Set methods to be better than previous isoperimetric methods. In order to learn about Evolving Sets we recommend the relevant chapter in our book with Tetali [23], and of course the original paper of Morris and Peres [26]. To learn about some applications please see our paper on Cheeger Inequalities [21], that on Canonical Path bounds for non-lazy walks [18], our alternate interpretation of Morris’ study of the Thorp shuffle [23, 25], Morris’ paper on the Exclusion process [24], and the paper of Diaconis and Fill on the duality method [2].
منابع مشابه
The Mixing of Markov Chains on Linear Extensions in Practice
We investigate almost uniform sampling from the set of linear extensions of a given partial order. The most efficient schemes stem from Markov chains whose mixing time bounds are polynomial, yet impractically large. We show that, on instances one encounters in practice, the actual mixing times can be much smaller than the worst-case bounds, and particularly so for a novel Markov chain we put fo...
متن کاملEvolving sets, mixing and heat kernel bounds
We show that a new probabilistic technique, recently introduced by the first author, yields the sharpest bounds obtained to date on mixing times of Markov chains in terms of isoperimetric properties of the state space (also known as conductance bounds or Cheeger inequalities). We prove that the bounds for mixing time in total variation obtained by Lovász and Kannan, can be refined to apply to t...
متن کاملMathematical Aspects of Mixing Times in Markov Chains
In the past few years we have seen a surge in the theory of finite Markov chains, by way of new techniques to bounding the convergence to stationarity. This includes functional techniques such as logarithmic Sobolev and Nash inequalities, refined spectral and entropy techniques, and isoperimetric techniques such as the average and blocking conductance and the evolving set methodology. We attemp...
متن کاملThe Speed of Evolution
Stochastic, finite-population models are extensively used in evolutionary biology to study asexual, fast-evolving populations of organisms such as viruses. Typically, such models consider a population consisting of several species; each species reproduces at a different rate, random mutations can cause conversions among them, and the population is subject to the evolutionary pressure of selecti...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007